Matching patterns in strings subject to multi-linear transformations

Matching Multi-lingual Subject Vocabularies

Most libraries and other cultural heritage institutions use controlled knowledge organisation systems, such as thesauri, to describe their collections. Unfortunately, as most of these institutions use different such systems, unified access to heterogeneous collections is difficult. Things are even worse in an international context when concepts have labels in different languages. In order to ov...

Consistent Linear-Elastic Transformations for Image Matching

A fundamental problem with a large class of image registration techniques is that the estimated transformation from image A to B does not equal the inverse of the estimated transform from B to A. This inconsistency is a result of the matching criteria’s inability to uniquely describe the correspondences between two images. This paper seeks to overcome this limitation by jointly estimating the t...

Pattern Matching in Strings

Transposition Invariant Pattern Matching for Multi-Track Strings

We consider the problem of multi-track string matching. The task is to find the occurrences of a pattern across parallel strings. Given an alphabet Σ of natural numbers and a set S over Σ of h strings si = s1 · · · s i n for i = 1, . . . , h, a pattern p = p1 · · · pm has such an occurrence at position j of S if p1 = s i1 j , p2 = s i2 j+1, . . . , pm = s im j+m−1 holds for i1, . . . , im ∈ {1,...

KMP Based Pattern Matching Algorithms for Multi-Track Strings

Multi-track string is an N -tuple strings of length n. For two multi-track strings T = (t1, t2, . . . , tN ) of length n and P = (p1, p2, ..., pM ) of length m, permuted pattern matching is a problem to find all positions i such that P is permuted match with T[i : i+M ]. We propose three new algorithms for permuted pattern matching based on the KMP algorithm. The first algorithm is an exact mat...